Extending CAPSL for Logic-Based Verifications
نویسندگان
چکیده
Cryptographic protocols are designed to provide security services, such as key distribution, authentication and non-repudiation, over insecure networks. The design process of cryptographic protocols is highly complex. In particular, the translation from the informal protocol description to the formal protocol specification is an error-prone step, as the exact meaning of the requirements of the security protocol need to be conveyed. This paper presents a case study on extending the Common Authentication Protocol Specification Language (CAPSL) to enable it to be used with logic-based formal verification tools for security protocols. Key-Words: specification of cryptographic protocols, verification of security protocols, CAPSL
منابع مشابه
Automatic verification of temporal-epistemic properties of cryptographic protocols
We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epistemic specifications. We present a compiler that implements this translation. The compiler links to the sy...
متن کاملA HOL Formalization of CAPSL Semantics
This paper describes a state-based Higher Order Logic theory of protocol failure that formalizes the semantics of the Common Authentication Protocol Specication Language, a speci cation language being developed for use by all protocol designers and all protocolanalysis tools. This theory gives the basis for a new, fast and thorough, protocol-analysis tool based on automatically constructing pro...
متن کاملImplementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover
We present an implementation of a program logic of objects, extending that (AL) of Abadi and Leino. In particular, the implementation uses higher-order abstract syntax (HOAS) and—unlike previous approaches using HOAS—at the same time uses the built-in higher-order logic of the theorem prover to formulate specifications. We give examples of verifications, extending those given in [1], that have ...
متن کاملA Compilation Method for the Verification of Temporal-Epistemic Properties of Cryptographic Protocols
We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. Our work is based on model checking multi-agent systems against properties given in AI logics. We present PC2IS, a compiler from CAPSL to ISPL, the input language of MCMAS, a symbolic model checker for MAS. The technique also reduces automatically the state space ...
متن کامل